Orientable domination in product-like graphs
نویسندگان
چکیده
The orientable domination number, DOM(G), of a graph G is the largest number over all orientations G. In this paper, DOM studied on different product graphs and related operations. arbitrary corona products determined, while sharp lower upper bounds are proved for Cartesian lexicographic products. A result Chartrand et al. (1996) extended by establishing values DOM(Kn1,n2,n3) positive integers n1,n2 n3. While considering graphs, we answer in negative question concerning packing numbers acyclic digraphs posed Brešar (2022).
منابع مشابه
Power Domination in Product Graphs
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dominating sets in graphs. The power domination number γP (G) of G is the minimum cardinality of a power dominating set. Dorfling and Henning [2] determined the power domination number of the Cartesian product of paths. I...
متن کاملOrientable Step Domination of Complete r-Partite Graphs
This paper provides lower orientable k-step domination number and upper orientable k-step domination number of complete r-partite graph for 1 ≤ k ≤ 2. It also proves that the intermediate value theorem holds for the complete r-partite graphs.
متن کاملInteger domination of Cartesian product graphs
Given a graph G, a dominating set D is a set of vertices such that any vertex not in D has at least one neighbor in D. A {k}-dominating multiset Dk is a multiset of vertices such that any vertex in G has at least k vertices from its closed neighborhood in Dk when counted with multiplicity. In this paper, we utilize the approach developed by Clark and Suen (2000) to prove a ‘‘Vizing-like’’ inequ...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملthe geodetic domination number for the product of graphs
a subset $s$ of vertices in a graph $g$ is called a geodetic set if every vertex not in $s$ lies on a shortest path between two vertices from $s$. a subset $d$ of vertices in $g$ is called dominating set if every vertex not in $d$ has at least one neighbor in $d$. a geodetic dominating set $s$ is both a geodetic and a dominating set. the geodetic (domination, geodetic domination) number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2023
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2022.11.003